Maximal bifix decoding

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Multiuser Decoding with Maximal Ratio Combining

In this paper we apply the concept of recursive maximal ratio combining over iterations in an iterative multiuser decoder. The principle can be applied to any multiuser estimator that does not exploit information across iterations. Here, we have applied the concept to a previously suggested iterative linear minimum mean squared error filter, improving the load in terms of number of supported us...

متن کامل

On Bifix Systems and Generalizations

Motivated by problems in infinite-state verification, we study word rewriting systems that extend mixed prefix/suffix rewriting (short: bifix rewriting). We introduce several types of infix rewriting where infix replacements are subject to the condition that they have to occur next to tag symbols within a given word. Bifix rewriting is covered by the case where tags occur only as end markers. W...

متن کامل

Bifix codes and Sturmian words

We study bifix codes in factorial sets of words. We generalize most properties of ordinary maximal bifix codes to bifix codes maximal in a recurrent set F of words (F -maximal bifix codes). In the case of bifix codes contained in Sturmian sets of words, we obtain several new results. Let F be a Sturmian set of words. Our results express the fact that an F -maximal bifix code of degree d behaves...

متن کامل

Complexity of regular bifix-free languages

We study descriptive complexity properties of the class of regular bifix-free languages, which is the intersection of prefix-free and suffix-free regular languages. We show that there exist a single ternary universal (stream of) bifix-free languages that meet all the bounds for the state complexity basic operations (Boolean operations, product, star, and reversal). This is in contrast with suff...

متن کامل

Short sequences and cross-bifix analysis

—An analytical approach to a search process for a set of M fixed sequences in random data covers the problems of a search for the sequences with errors, as well as of a search for the distributed sequences. It is of greater practical interest than the formerly analysed case of search for a single sequence. This paper derives statistical parameters (probability distribution function, expected va...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2015

ISSN: 0012-365X

DOI: 10.1016/j.disc.2014.12.010